Fast numerical algorithms with universal matrices for finding element matrices of quadrilateral and hexahedral elements
نویسندگان
چکیده
منابع مشابه
Quadrilateral and Hexahedral Element Meshes
This chapter explains techniques for the generation of quadrilateral and hexahedral element meshes. Since structured meshes are discussed in detail in other parts of this volume, we focus on the generation of unstructured meshes, with special attention paid to the 3D case. Quadrilateral or hexahedral element meshes are the meshes of choice for many applications, a fact that can be explained emp...
متن کاملAlgorithms for Quadrilateral and Hexahedral Mesh Generation
This lecture reviews the state of the art in quadrilateral and hexahedral mesh generation. Three lines of development – block decomposition, superposition and the dual method – are described. The refinement problem is discussed, and methods for octree-based meshing are presented.
متن کاملFast Algorithms for Toeplitz and Hankel Matrices
The paper gives a self-contained survey of fast algorithms for solving linear systems of equations with Toeplitz or Hankel coefficient matrices. It is written in the style of a textbook. Algorithms of Levinson-type and of Schur-type are discussed. Their connections with triangular factorizations, Padè recursions and Lanczos methods are demonstrated. In the case in which the matrices possess add...
متن کاملProperties of matrices with numerical ranges in a sector
Let $(A)$ be a complex $(ntimes n)$ matrix and assume that the numerical range of $(A)$ lies in the set of a sector of half angle $(alpha)$ denoted by $(S_{alpha})$. We prove the numerical ranges of the conjugate, inverse and Schur complement of any order of $(A)$ are in the same $(S_{alpha})$.The eigenvalues of some kinds of matrix product and numerical ranges of hadmard product, star-congruen...
متن کاملFast algorithms for hierarchically semiseparable matrices
Semiseparable matrices and many other rank-structured matrices have been widely used in developing new fast matrix algorithms. In this paper, we generalize the hierarchically semiseparable (HSS) matrix representations and propose some fast algorithms for HSS matrices. We represent HSS matrices in terms of general binary HSS trees and use simplified postordering notation for HSS forms. Fast HSS ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ain Shams Engineering Journal
سال: 2021
ISSN: 2090-4479
DOI: 10.1016/j.asej.2020.06.015